package binarySearch;

public class findPeakElement {
    public int findPeakElement(int[] nums) {
        if(nums.length<2) return 0;
        int left=0;
        int right=nums.length-1;
        while(left<right){
            int mid=left+(right-left+1)/2;
            if(nums[mid]>nums[mid-1]) left=mid;
            else right=mid-1;
        }
        return left;
    }
}
